Robust Polygon
نویسنده
چکیده
The article provides a set of algorithms for performing set operations on polygonal regions in the plane using standard oating point arithmetic. The algorithms are robust, guaranteeing both topological consistency and numerical accuracy. Each polygon edge is modeled as an implicit or explicit polygonal curve which stays within some distance of the original line segment. If the curve is implicit, is bounded by a small multiple of the rounding unit. If the curves are explicit, the bound on may grow with the number of curves. One can mix implicit and explicit representations to suit the application.
منابع مشابه
Robust Tensegrity Polygons
A tensegrity polygon is a planar cable-strut tensegrity framework in which the cables form a convex polygon containing all vertices. The underlying edgelabeled graph, in which the cable edges form a Hamilton cycle, is an abstract tensegrity polygon. It is said to be robust if every convex realization as a tensegrity polygon has an equilibrium stress which is positive on the cables and negative ...
متن کاملRobust Point Location in Approximate Polygons (extended Abstract)
Introduction Most geometric algorithms assume that perfect \real" arithmetic is available. When these algorithms are implemented they often fail because this assumption is not borne out; that is, these algorithms are not robust. This failure occurs because either the input or the intermediate calculations are imprecise, leading to inconsistent decisions by the algorithm. This paper presents a f...
متن کاملA comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
The nofit polygon an important tool in the area of irregular shape stock cutting problems. It provides efficient handling of the geometric characteristics of the problem. The paper presents a new algorithmic procedure for deriving this tool. Abstract The nofit polygon is a powerful and effective tool for handling the geometric requirements of solution approaches to irregular cutting and packing...
متن کاملRobust Point Location in Approximate Polygons
This paper presents a framework for reasoning about robust geoemtric algorithms. Robustness is formally deened and a data structure called an approximate polygon is introduced and used to reason about polygons constructed of edges whose positions are uncertain. A robust algorithm for point location in an approximate polygon is presented. The algorithm uses only the signature of the point (not i...
متن کاملAn algorithm for determining intersection segment-polygon in 3D
ÐIn the ®elds related to geometric modelling, it is fundamental to count on robust. In this work we present a new algorithm for testing the intersection between a segment and a polygon in 3D space. This algorithm is robust and ecient, and it is the basis of most operations developed in geometric modelling. After, we will apply this algorithm to a classic problem in computer graphics: determini...
متن کامل